Uses of Class
edu.claflin.finder.logic.Node

Packages that use Node

Package	Description
edu.claflin.finder.algo	Contains the Algorithm code for finding bipartite subgraphs.
edu.claflin.finder.algo.clustering
edu.claflin.finder.logic	Contains the data structure and processing code-base.
edu.claflin.finder.logic.communities
edu.claflin.finder.logic.communities.struct.fast_greedy_struct
edu.claflin.finder.logic.cond	Contains Condition implementations for identifying subgraph types.

Uses of Node in edu.claflin.finder.algo

Methods in edu.claflin.finder.algo that return Node

Modifier and Type	Method	Description
private Node	DijkstraShortestPath.closestReachableUnvisited(java.util.HashMap<Node,java.lang.Double> shortestPathMap, Graph graph, java.util.Set<java.lang.String> visited)

Methods in edu.claflin.finder.algo with parameters of type Node

Modifier and Type	Method	Description
private void	ConnectedComponentsDFS.dfs(Node n, java.util.List<Node> inodes, java.util.List<Node> onodes, Graph orig)	Recursive dfs that stores the nodes of a connected component.
private Graph	ShortestPath.removePaths(Graph graph, Node from, Node to)	Private class for removing visited paths that not reach the destination node.
private Graph	BreadthFirstTraversalSearch.searchNode(Graph graph, Node node)	Helper method to search for the SubGraphs in Breadth First Search.
private Graph	DepthFirstTraversalSearch.searchNode(Graph graph, Graph subGraph, Node node, java.util.List<Node> visited)	Helper method to search for the SubGraphs in Depth First search.

Method parameters in edu.claflin.finder.algo with type arguments of type Node

Modifier and Type	Method	Description
private Node	DijkstraShortestPath.closestReachableUnvisited(java.util.HashMap<Node,java.lang.Double> shortestPathMap, Graph graph, java.util.Set<java.lang.String> visited)
private void	ConnectedComponentsDFS.dfs(Node n, java.util.List<Node> inodes, java.util.List<Node> onodes, Graph orig)	Recursive dfs that stores the nodes of a connected component.
private Graph	DepthFirstTraversalSearch.searchNode(Graph graph, Graph subGraph, Node node, java.util.List<Node> visited)	Helper method to search for the SubGraphs in Depth First search.

Uses of Node in edu.claflin.finder.algo.clustering

Fields in edu.claflin.finder.algo.clustering with type parameters of type Node

Modifier and Type	Field	Description
private java.util.HashMap<Node,java.lang.Integer>	Walktrap.degrees
private java.util.HashMap<java.lang.Integer,java.util.List<Node>>	Walktrap.list
private java.util.HashMap<java.lang.Integer,java.util.HashMap<Node,java.lang.Double>>	Walktrap.Pv

Methods in edu.claflin.finder.algo.clustering that return types with arguments of type Node

Modifier and Type	Method	Description
private java.util.HashMap<Node,java.lang.Double>	Walktrap.cprobs(java.util.List<Node> C, Graph graph, java.util.List<Node> graphNodes)	Get a probability vector for a community.
private java.util.HashMap<Node,java.lang.Double>	Walktrap.merge_probs(int i, int j)	Calculate the probability vectors of joining 2 communities.

Method parameters in edu.claflin.finder.algo.clustering with type arguments of type Node

Modifier and Type	Method	Description
protected java.util.ArrayList<Graph>	ClusteringAlgorithm.buildCommunityGraphs(java.util.List<java.util.List<Node>> cs, Graph graph)
private java.util.HashMap<Node,java.lang.Double>	Walktrap.cprobs(java.util.List<Node> C, Graph graph, java.util.List<Node> graphNodes)	Get a probability vector for a community.
private double	Walktrap.delta_sigma(int C1index, int C2index, java.util.List<Node> graphNodes)	Calculate delta sigma from communities C1 and C2 according to Section 4.2 Theorem 5 in the paper.
private double	Walktrap.distance(int i, int j, java.util.List<Node> graphNodes)	Compute the distance between community i and community j.

Uses of Node in edu.claflin.finder.logic

Fields in edu.claflin.finder.logic declared as Node

Modifier and Type	Field	Description
private Node	Edge.destination	The node representing the destination.
private Node	Edge.source	The node representing the source.

Fields in edu.claflin.finder.logic with type parameters of type Node

Modifier and Type	Field	Description
private java.util.ArrayList<Node>	Graph.nodeList	The list of the nodes added to the graph.

Methods in edu.claflin.finder.logic that return Node

Modifier and Type	Method	Description
Node	Node.duplicate()	Returns a copy of this Node that is a new object in memory.
Node	Edge.getDestination()	Access method for the Edge's destination.
Node	Graph.getNode(java.lang.String NodeName)	Gets a node based on its name.
Node	Edge.getSource()	Access method for the Edge's source.

Methods in edu.claflin.finder.logic that return types with arguments of type Node

Modifier and Type	Method	Description
static java.util.ArrayList<java.util.ArrayList<Node>>	BronKerboschBipartiteUtils.bipartiteDivision(Graph existingGraph)	Divides the given graph into bipartite sets.
static java.util.ArrayList<java.util.ArrayList<Node>>	BronKerboschBipartiteUtils.constructArrayList(java.util.Set<Node> groupA, java.util.Set<Node> groupB)	Constructs array list of array lists from sets.
java.util.List<Node>	Graph.getAdjacencyList(Node node)	Obtains an adjacency list for the supplied node based on the Graph.
java.util.List<Node>	Graph.getNodeList()	Returns the list of nodes in the graph.
java.util.ArrayList<Node>	Graph.uniqueCopyNodeList()	Clone method that only clones the node list, done for convenience because lists don't have built in cloning.

Methods in edu.claflin.finder.logic with parameters of type Node

Modifier and Type	Method	Description
boolean	Graph.addNode(Node node)	Adds a node to the graph.
private void	Graph.checkNode(Node node)	Verifies that the node is NOT in the graph.
int	Node.compareTo(Node that)
boolean	Graph.containsNode(Node node)	Checks if the graph contains the given node.
Edge	Edge.duplicate(Node source, Node destination)	Attempts to duplicate an Edge based on the supplied parameters.
java.util.List<Node>	Graph.getAdjacencyList(Node node)	Obtains an adjacency list for the supplied node based on the Graph.
int	Graph.getDegree(Node n)
Edge	Graph.getEdge(Node source, Node destination)	Locates an Edge object in the edgeList and returns it.
int	Graph.getNodeIndex(Node node)	Gets the index of a Node object in memory.
void	Graph.removeEdgesInvolving(Node n)	Remove all the edges in which the given Node participates.
void	Graph.removeNode(Node node)	Removes a node from the set.
private static boolean	BronKerboschBipartiteUtils.satisfies(Graph existingGraph, java.util.Set<Node> addSet, java.util.Set<Node> compareSet, Node current)	Private method for stepping through the adjacency lists and determining if the graph is bipartite.
void	Graph.transferEdgesContainingNodeFromGraph(Graph graph, Node node)	Adds all edges containing the input node from the input graph to this graph, provided that the other vertex is already within this graph.
void	Graph.transpose(Node node1, Node node2)	Transposes the specified nodes.

Method parameters in edu.claflin.finder.logic with type arguments of type Node

Modifier and Type	Method	Description
void	Graph.addEdgesBetweenAllNodesInList(java.util.ArrayList<Node> list)	Adds edges in between all possible pair combinations of nodes in a list if both nodes involved are present in the graph.
boolean	Graph.addNodes(java.util.List<Node> nodes)	Adds a list of nodes to the graph.
boolean	ConditionedGraph.addPartialGraph(java.util.List<Node> nodes, java.util.List<Edge> edges)	Adds a partial graph to this graph.
boolean	Graph.addPartialGraph(java.util.List<Node> nodes, java.util.List<Edge> edges)	Adds a partial graph to this graph.
static java.util.ArrayList<java.util.ArrayList<Node>>	BronKerboschBipartiteUtils.constructArrayList(java.util.Set<Node> groupA, java.util.Set<Node> groupB)	Constructs array list of array lists from sets.
java.util.ArrayList<Edge>	Graph.getEdgesBack(java.util.List<Node> nodes)	Gets the list edges of this Graph that involve the nodes in the given list
Graph	Graph.getSubGraph(java.util.List<Node> nodes, java.lang.String nameQualifier)	Returns a subGraph of this graph.
void	Graph.intersect(java.util.List<Node> list)	Intersects this graph's node list with the input list.
void	Graph.removeEdgesBetweenAllNodesInList(java.util.ArrayList<Node> list)	Removes edges in between all possible pair combinations of nodes in a list if both nodes involved are present in the graph.
private static boolean	BronKerboschBipartiteUtils.satisfies(Graph existingGraph, java.util.Set<Node> addSet, java.util.Set<Node> compareSet, Node current)	Private method for stepping through the adjacency lists and determining if the graph is bipartite.
private void	ConditionedGraph.superAddPartialGraph(java.util.List<Node> nodes, java.util.List<Edge> edges)	Private method for circumventing the condition restrictions.

Constructors in edu.claflin.finder.logic with parameters of type Node

Constructor	Description
Edge(Node source, Node destination, D data, boolean undirected)	Initializes the Edge object.

Constructor parameters in edu.claflin.finder.logic with type arguments of type Node

Constructor	Description
Graph(java.lang.String graphName, java.util.ArrayList<Node> nodeList, java.util.ArrayList<Edge> edgeList)	Private constructor used by subGraph method.

Uses of Node in edu.claflin.finder.logic.communities

Fields in edu.claflin.finder.logic.communities with type parameters of type Node

Modifier and Type	Field	Description
private java.util.HashMap<java.lang.Integer,java.util.List<Node>>	Communities.list

Methods in edu.claflin.finder.logic.communities that return types with arguments of type Node

Modifier and Type	Method	Description
java.util.List<java.util.List<Node>>	Communities.getList()

Methods in edu.claflin.finder.logic.communities with parameters of type Node

Modifier and Type	Method	Description
int	Communities.indexOfNode(Node n)
int	Communities.NodesInSameCommunity(Node n1, Node n2)	Determine if 2 Nodes are in the same Community.

Method parameters in edu.claflin.finder.logic.communities with type arguments of type Node

Modifier and Type	Method	Description
double	Communities.a(java.util.List<Node> c)
boolean	Communities.connectedCommunities(java.util.List<Node> c1, java.util.List<Node> c2)
double	Communities.e(java.util.List<Node> c1, java.util.List<Node> c2)

Constructor parameters in edu.claflin.finder.logic.communities with type arguments of type Node

Constructor	Description
Communities(java.util.HashMap<java.lang.Integer,java.util.List<Node>> list, Graph g)

Uses of Node in edu.claflin.finder.logic.communities.struct.fast_greedy_struct

Fields in edu.claflin.finder.logic.communities.struct.fast_greedy_struct with type parameters of type Node

Modifier and Type	Field	Description
private java.util.List<Node>	VectorValue.community

Methods in edu.claflin.finder.logic.communities.struct.fast_greedy_struct that return types with arguments of type Node

Modifier and Type	Method	Description
java.util.List<Node>	VectorValue.getCommunity()

Constructor parameters in edu.claflin.finder.logic.communities.struct.fast_greedy_struct with type arguments of type Node

Constructor	Description
VectorValue(java.util.List<Node> c)
VectorValue(java.util.List<Node> c, double a)

Uses of Node in edu.claflin.finder.logic.cond

Methods in edu.claflin.finder.logic.cond with parameters of type Node

Modifier and Type	Method	Description
private boolean	BipartiteCondition.satisfies(Graph existingGraph, java.util.Set<Node> addSet, java.util.Set<Node> compareSet, Node current)	Private method for stepping through the adjacency lists and determining if the graph is bipartite.

Method parameters in edu.claflin.finder.logic.cond with type arguments of type Node

Modifier and Type	Method	Description
private boolean	BipartiteCondition.satisfies(Graph existingGraph, java.util.Set<Node> addSet, java.util.Set<Node> compareSet, Node current)	Private method for stepping through the adjacency lists and determining if the graph is bipartite.